Hoare logic for multistaged programs

In this work we present a straight forward extension of Hoare logic that caters for multistaged programs. We have chosen a minimalist support language which allowed us to focus on the issues pertaining to the staged features. Similarly, the support logic is a simple, staged, first order logic with equality assertions. We allow the equality assertions to contain descriptions of staged code in the form of pre post conditions which are in turn expressed as formulas in our logic. We formulate Hoare rules for each of the language constructs. Furthermore we prove the rules sound with respect to an intuitive semantic of our staged language. The formalization is done in Coq, proofs are available at: http://www.comp.nus.edu.sg/ cristian/projects